package com.chenken.array;

/**
 *	给定两个有序整数数组nums1和nums2,将nums2合并到nums1中
 *  使得nums1成为一个有序数组 
 *	https://leetcode-cn.com/problems/merge-sorted-array/
 */
public class MergeSortedArray {

	/**
	 * 	  输入：nums1 = [1,2,3,0,0,0], m = 3, nums2 = [2,5,6], n = 3
	 *   输出：[1,2,2,3,5,6]
	 *     
	 *   输入：nums1 = [1], m = 1, nums2 = [], n = 0
	 *   输出：[1]   
	 */
	public void merge(int[] nums1, int m, int[] nums2, int n) {
		
    }
	
}
